il,, lsoperimetric Inequalities for Graphs, and Superconcentrators
نویسنده
چکیده
A general method for obtaining asymptotic isoperimetric inequalities for families of graphs is developed. Some of these inequalities have been applied to functional analysis, This method uses the second smallest eigenvalue of a certain matrix associated with the graph and it is the discrete version of a method used before for Riemannian manifolds. Also some results are obtained on spectra of graphs that show how this eigenvalue is related to the structure of the graph. Combining these results with some known results on group representations many new examples are constructed explicitly of linear sized expanders and superconcentrators. ‘i:\ 1985 Academic Press. Inc.
منابع مشابه
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
We show that the size of the smallest depth-two N -superconcentrator is Θ(N log N/ log logN). Before this work, optimal bounds were known for all depths except two. For the upper bound, we build superconcentrators by putting together a small number of disperser graphs; these disperser graphs are obtained using a probabilistic argument. For obtaining lower bounds, we present two different method...
متن کاملTight Bounds for Depth-two Superconcentrators
We show that the minimum size of a depth-two N-superconcentrator is (N log 2 N= loglog N). Before this work, optimal bounds were known for all depths except two. For the upper bound, we build superconcentrators by putting together a small number of disperser graphs; these disperser graphs are obtained using a probabilistic argument. We present two diierent methods for showing lower bounds. Firs...
متن کاملOn Zarankiewicz Problem and Depth-Two Superconcentrators
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of Kővári, Sós and Turán on the minimum number of edges in a bipartite graph that has no large independent set, and the theore...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملBetter Expanders and Superconcentrators by Kolmogorov Complexity
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best known bounds on the size of expanders and superconcentrators can be obtained this way. In the case of (acyclic) superconcentrators we obtain the density 34. Also, we review related graph properties, like magnification, edg...
متن کامل